Local limits of Markov branching trees and their volume growth

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scaling limits of Markov branching trees

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the number of leaves or vertices. Such families are parameterized by sequences of distributions on partitions of the integers, that determine how the size of a ...

متن کامل

Critical Age Dependent Branching Markov Processes and Their Scaling Limits

This paper studies: (i) the long time behaviour of the empirical distribution of age and normalised position of an age dependent critical branching Markov process conditioned on non-extinction; and (ii) the super-process limit of a sequence of age dependent critical branching Brownian motions.

متن کامل

Scaling limits of Markov branching trees, with applications to Galton-Watson and random unordered trees

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the number of leaves or vertices. Such families are parameterized by sequences of distributions on partitions of the integers, that determine how the size of a ...

متن کامل

Local limits of random trees and maps

These pages form the lecture notes of a mini-course given at the IXth Young European Probabilists conference that took place in Eindhoven (March 2012). They contain some material extracted from [2, 8, 9]. We survey some aspects of local limits of random trees and maps and deal in particular with the so-called geometric Galton-Watson tree conditioned to survive and the uniform infinite planar qu...

متن کامل

Consistent Markov branching trees with discrete edge lengths∗

We study consistent collections of random fragmentation trees with random integervalued edge lengths. We prove several equivalent necessary and sufficient conditions under which Geometrically distributed edge lengths can be consistently assigned to a Markov branching tree. Among these conditions is a characterization by a unique probability measure, which plays a role similar to the dislocation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2017

ISSN: 1083-6489

DOI: 10.1214/17-ejp96